Interactive coin offerings

نویسنده

  • Jason Teutsch
چکیده

Ethereum has emerged as a dynamic platform for exchanging cryptocurrency tokens. While token crowdsales cannot simultaneously guarantee buyers both certainty of valuation and certainty of participation, we show that if each token buyer specifies a desired purchase quantity at each valuation then everyone can successfully participate. Our implementation introduces smart contract techniques which recruit outside participants in order to circumvent computational complexity barriers. 1 A crowdsale dilemma This year has witnessed the remarkable rise of token crowdsales. Token incentives enable new community structures by employing novel combinations of currency rewards, software use rights, protocol governance, and traditional equity. Excluding Bitcoin, the total market cap of the token market surged over 60 billion USD in June 20171. Most tokens originate on the Ethereum network, and, at times, the network has struggled to keep up with purchase demands. On several occasions, single crowdsales have consumed the network’s entire bandwidth for consecutive hours. Token distributions can take many forms. Bitcoin, for example, continues to distribute tokens through a competitive, computational process known as mining. In this exposition, we shall concern ourselves exclusively https://coinmarketcap.com/charts/

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Proof Systems

We show a rough equivalence between alternating time-space complexity and a public-coin interactive proof system with the veriier having a polynomial related time-space complexity. Special cases include All of NC has interactive proofs with a log-space polynomial-time public-coin veriier vastly improving the best previous lower bound of LOGCFL for this model 7]. All languages in P have interact...

متن کامل

ar X iv : 0 90 3 . 31 18 v 1 [ qu an t - ph ] 1 8 M ar 2 00 9 Generation of a Common Reference String , secure against Quantum Adversaries , and Applications

In this paper, we present the generation of a common reference string “from scratch” via coin-flipping in the presence of a quantum adversary. First, we present how we achieve quantumsecure coin-flipping using Watrous’ quantum rewinding technique [Wat06]. Then, by combining this coin-flipping with any non-interactive zero-knowledge protocol we get an easy transformation from non-interactive zer...

متن کامل

Regulation of Initial Coin Offerings∗

We analyze the regulation of initial coin offerings (ICOs), in which a company raises funds by pre-selling access to a later product or service. We start by presenting a model that rationalizes the use of ICOs for launching peer-to-peer platforms: by adding dynamics to a platform launch, ICOs can 1) solve a coordination failure problem inherent in many projects with network effects (strategic c...

متن کامل

Quantum-Secure Coin-Flipping and Applications

In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [20] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-flipping with any non-interactive zero-knowledge protocol leads to an easy transformation from non-interactive zero-knowledge t...

متن کامل

ar X iv : 0 90 3 . 31 18 v 2 [ qu an t - ph ] 2 9 M ay 2 00 9 Quantum - Secure Coin - Flipping and Applications

In this paper, we prove a well-known classical coin-flipping protocol secure in the presence of quantum adversaries. More precisely, we show that the protocol implements a natural ideal functionality for coin-flipping. The proof uses a recent result of Watrous [Wat06] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017